A Complexity-reduced Interpolation Algorithm for Soft-decision Decoding of Reed-solomon Codes†
نویسندگان
چکیده
Soon after Lee and O’Sullivan proposed a new interpolation algorithm for algebraic soft-decision decoding of Reed-Solomon codes, there have been some attempts to apply a coordinate transformation technique to the new algorithm, with a remarkable complexity reducing effect. In this paper, a conceptually simple way of applying the transformation technique to the interpolation algorithm is proposed. AMS Mathematics Subject Classification: 94B35, 94B27.
منابع مشابه
Algebraic Soft-Decision Decoding of Reed–Solomon Codes
A polynomial-time soft-decision decoding algorithm for Reed–Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into a set of interpolation points, along w...
متن کاملEfficient Interpolation Architecture for Soft-Decision List Decoding of Reed- Solomon Codes
Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The main task in the algorithm is the weighted interpolation of a bivariate polynomial that requires intensive computations. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list deco...
متن کاملEfficient Interpolation and Factorization in Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Algebraic soft-decision decoding of Reed-Solomon codes delivers promising coding gains over conventional hard-decision decoding. The main computational steps in algebraic soft-decoding (as well as Sudan-type list-decoding) are bivariate interpolation and factorization. We discuss a new computational technique, based upon re-encoding and coordinate transformation, that significantly reduces the ...
متن کاملA Vlsi Architecture for Interpolation in Soft-decision List Decoding of Reed-solomon Codes
The Koetter-Vardy algorithm is an algebraic soft-decision decoder for Reed-Solomon codes which is based on the Guruswami-Sudan list decoder. There are three main steps: 1) multiplicity calculation, 2) interpolation and 3) root finding. The Koetter-Vardy algorithm is challenging to implement due to the high cost of interpolation. We propose a VLSI architecture for interpolation that uses a trans...
متن کاملIterative Multivariate Interpolation for Low Complexity Reed - Solomon Codes
The algebraic soft-decoding (ASD) of Reed– Solomon (RS) codes provides significant coding gain over hard-decision decoding with polynomial complexity. In order to reduce the complexity in this paper, high-throughput interpolator architecture for soft-decision decoding of Reed– Solomon (RS) codes based on low-complexity chase (LCC) decoding is presented. An efficiency is low, in terms of areadel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013